Vertex Degrees in Planar Maps
نویسندگان
چکیده
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. We also discuss the possible extension to maps of higher genus.
منابع مشابه
Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
We give a bijection between Eulerian planar maps with prescribed vertex degrees, and some plane trees that we call balanced Eulerian trees. To enumerate the latter, we introduce conjugation classes of planted plane trees. In particular the result answers a question of Bender and Canfield in [BC94] and allows uniform random generation of Eulerian planar maps with restricted vertex degrees. Using...
متن کاملThe two-point function of bicolored planar maps
We compute the distance-dependent two-point function of vertex-bicolored planar maps, i.e., maps whose vertices are colored in black and white so that no adjacent vertices have the same color. By distance-dependent two-point function, we mean the generating function of these maps with both a marked oriented edge and a marked vertex which are at a prescribed distance from each other. As customar...
متن کاملVertex Degrees in Planar Graphs
For a planar graph on n vertices we determine the maximum values for the following: 1) the sum of the m largest vertex degrees. 2) the number of vertices of degree at least k. 3) the sum of the degrees of vertices with degree at least k.
متن کاملA Tridiagonal Approach to Matrix Integrals
Physicists in the 70’s starting with ’t Hooft established that the number of suitably labeled planar maps with prescribed vertex degree distribution can be represented as the leading coefficient of the 1 N -expansion of a joint cumulant of traces of powers of a standard N-by-N GUE matrix. Here we undertake the calculation of this leading coefficient in a different way, namely, after first tridi...
متن کاملEnumeration of eulerian and unicursal planar maps
Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...
متن کامل